0.11/0.11 % Problem : SLH637^1 : TPTP v7.5.0. Released v7.5.0. 0.11/0.13 % Command : run_E %s %d THM 0.13/0.33 % Computer : n012.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 30 0.13/0.33 % WCLimit : 30 0.13/0.33 % DateTime : Tue Aug 9 03:19:29 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.46 The problem SPC is TH0_THM_EQU_NAR 0.19/0.46 Running higher-order on 1 cores theorem proving 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.46 # Version: 3.0pre003-ho 0.54/0.73 # Preprocessing class: HSLSSMSSSSSNHSA. 0.54/0.73 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.54/0.73 # Starting full_lambda_9 with 30s (1) cores 0.54/0.73 # full_lambda_9 with pid 28075 completed with status 0 0.54/0.73 # Result found by full_lambda_9 0.54/0.73 # Preprocessing class: HSLSSMSSSSSNHSA. 0.54/0.73 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.54/0.73 # Starting full_lambda_9 with 30s (1) cores 0.54/0.73 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.54/0.73 # ...ProofStateSinE()=324/398 0.54/0.73 # Search class: HGHSM-FSLM32-DHSFFSBN 0.54/0.73 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.54/0.73 # Starting full_lambda_3 with 14s (1) cores 0.54/0.73 # full_lambda_3 with pid 28076 completed with status 0 0.54/0.73 # Result found by full_lambda_3 0.54/0.73 # Preprocessing class: HSLSSMSSSSSNHSA. 0.54/0.73 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.54/0.73 # Starting full_lambda_9 with 30s (1) cores 0.54/0.73 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.54/0.73 # ...ProofStateSinE()=324/398 0.54/0.73 # Search class: HGHSM-FSLM32-DHSFFSBN 0.54/0.73 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.54/0.73 # Starting full_lambda_3 with 14s (1) cores 0.54/0.73 # Preprocessing time : 0.008 s 0.54/0.73 0.54/0.73 # Proof found! 0.54/0.73 # SZS status Theorem 0.54/0.73 # SZS output start CNFRefutation 0.54/0.73 thf(decl_22, type, comp_nat_nat_nat: (nat > nat) > (nat > nat) > nat > nat). 0.54/0.73 thf(decl_23, type, comp_nat_nat_b: (nat > nat) > (b > nat) > b > nat). 0.54/0.73 thf(decl_24, type, comp_nat_a_nat: (nat > a) > (nat > nat) > nat > a). 0.54/0.73 thf(decl_25, type, comp_nat_a_a: (nat > a) > (a > nat) > a > a). 0.54/0.73 thf(decl_26, type, comp_nat_a_b: (nat > a) > (b > nat) > b > a). 0.54/0.73 thf(decl_27, type, comp_nat_b_nat: (nat > b) > (nat > nat) > nat > b). 0.54/0.73 thf(decl_28, type, comp_nat_b_b: (nat > b) > (b > nat) > b > b). 0.54/0.73 thf(decl_29, type, comp_a_nat_nat: (a > nat) > (nat > a) > nat > nat). 0.54/0.73 thf(decl_30, type, comp_a_nat_b: (a > nat) > (b > a) > b > nat). 0.54/0.73 thf(decl_31, type, comp_a_a_nat: (a > a) > (nat > a) > nat > a). 0.54/0.73 thf(decl_32, type, comp_a_a_a: (a > a) > (a > a) > a > a). 0.54/0.73 thf(decl_33, type, comp_a_a_b: (a > a) > (b > a) > b > a). 0.54/0.73 thf(decl_34, type, comp_a_b_nat: (a > b) > (nat > a) > nat > b). 0.54/0.73 thf(decl_35, type, comp_a_b_a: (a > b) > (a > a) > a > b). 0.54/0.73 thf(decl_36, type, comp_a_b_b: (a > b) > (b > a) > b > b). 0.54/0.73 thf(decl_37, type, comp_b_nat_nat: (b > nat) > (nat > b) > nat > nat). 0.54/0.73 thf(decl_38, type, comp_b_nat_b: (b > nat) > (b > b) > b > nat). 0.54/0.73 thf(decl_39, type, comp_b_a_nat: (b > a) > (nat > b) > nat > a). 0.54/0.73 thf(decl_40, type, comp_b_a_a: (b > a) > (a > b) > a > a). 0.54/0.73 thf(decl_41, type, comp_b_a_b: (b > a) > (b > b) > b > a). 0.54/0.73 thf(decl_42, type, comp_b_b_nat: (b > b) > (nat > b) > nat > b). 0.54/0.73 thf(decl_43, type, comp_b_b_a: (b > b) > (a > b) > a > b). 0.54/0.73 thf(decl_44, type, comp_b_b_b: (b > b) > (b > b) > b > b). 0.54/0.73 thf(decl_45, type, fcomp_nat_nat_a: (nat > nat) > (nat > a) > nat > a). 0.54/0.73 thf(decl_46, type, fcomp_nat_a_a: (nat > a) > (a > a) > nat > a). 0.54/0.73 thf(decl_47, type, fcomp_nat_b_a: (nat > b) > (b > a) > nat > a). 0.54/0.73 thf(decl_48, type, fcomp_nat_b_b: (nat > b) > (b > b) > nat > b). 0.54/0.73 thf(decl_49, type, fcomp_b_a_a: (b > a) > (a > a) > b > a). 0.54/0.73 thf(decl_50, type, fcomp_b_b_a: (b > b) > (b > a) > b > a). 0.54/0.73 thf(decl_51, type, swap_nat_nat: nat > nat > (nat > nat) > nat > nat). 0.54/0.73 thf(decl_52, type, swap_nat_a: nat > nat > (nat > a) > nat > a). 0.54/0.73 thf(decl_53, type, swap_nat_b: nat > nat > (nat > b) > nat > b). 0.54/0.73 thf(decl_54, type, swap_b_a: b > b > (b > a) > b > a). 0.54/0.73 thf(decl_55, type, swap_b_b: b > b > (b > b) > b > b). 0.54/0.73 thf(decl_56, type, comm_monoid_nat: (nat > nat > nat) > nat > $o). 0.54/0.73 thf(decl_57, type, monoid_nat: (nat > nat > nat) > nat > $o). 0.54/0.73 thf(decl_58, type, plus_plus_nat: nat > nat > nat). 0.54/0.73 thf(decl_59, type, zero_zero_nat: nat). 0.54/0.73 thf(decl_60, type, listIn1417627087drop_a: nat > (nat > a) > nat > a). 0.54/0.73 thf(decl_61, type, listIn1417627088drop_b: nat > (nat > b) > nat > b). 0.54/0.73 thf(decl_62, type, ord_less_nat: nat > nat > $o). 0.54/0.73 thf(decl_63, type, ord_less_eq_nat: nat > nat > $o). 0.54/0.73 thf(decl_64, type, f: b > a). 0.54/0.73 thf(decl_65, type, g: nat > b). 0.54/0.73 thf(decl_66, type, n: nat). 0.54/0.73 thf(decl_67, type, esk1_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_68, type, esk2_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_69, type, esk3_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_70, type, esk4_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_71, type, esk5_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_72, type, esk6_2: (nat > $o) > nat > nat). 0.54/0.73 thf(decl_73, type, esk7_1: (nat > $o) > nat). 0.54/0.73 thf(decl_74, type, esk8_2: nat > nat > nat). 0.54/0.73 thf(decl_75, type, esk9_2: nat > nat > nat). 0.54/0.73 thf(decl_76, type, esk10_1: (nat > nat) > nat). 0.54/0.73 thf(decl_77, type, esk11_1: (nat > nat) > nat). 0.54/0.73 thf(decl_78, type, esk12_2: nat > nat > nat). 0.54/0.73 thf(decl_79, type, esk13_2: nat > nat > nat). 0.54/0.73 thf(decl_80, type, esk14_2: nat > (nat > $o) > nat). 0.54/0.73 thf(decl_81, type, esk15_2: nat > (nat > $o) > nat). 0.54/0.73 thf(decl_82, type, esk16_1: (nat > nat) > nat). 0.54/0.73 thf(decl_83, type, esk17_1: (nat > nat) > nat). 0.54/0.73 thf(decl_84, type, esk18_1: (nat > $o) > nat). 0.54/0.73 thf(decl_85, type, esk19_1: (nat > $o) > nat). 0.54/0.73 thf(decl_86, type, esk20_2: (nat > $o) > nat > nat). 0.54/0.73 thf(decl_87, type, esk21_1: (nat > $o) > nat). 0.54/0.73 thf(decl_88, type, esk22_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_89, type, esk23_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_90, type, esk24_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_91, type, esk25_1: (nat > nat > $o) > nat). 0.54/0.73 thf(decl_92, type, esk26_0: nat). 0.54/0.73 thf(decl_93, type, esk27_4: (b > a) > (b > a) > (nat > b) > (nat > b) > nat). 0.54/0.73 thf(decl_94, type, esk28_4: (b > a) > (nat > nat) > (nat > b) > (nat > a) > nat). 0.54/0.73 thf(decl_95, type, esk29_4: (a > a) > (b > a) > (nat > b) > (nat > a) > nat). 0.54/0.73 thf(decl_96, type, esk30_4: (nat > a) > (nat > nat) > (nat > nat) > (nat > a) > nat). 0.54/0.73 thf(decl_97, type, esk31_4: (a > a) > (nat > nat) > (nat > a) > (nat > a) > nat). 0.54/0.73 thf(decl_98, type, esk32_4: (b > b) > (b > b) > (nat > b) > (nat > b) > nat). 0.54/0.73 thf(decl_99, type, esk33_4: (b > a) > (b > b) > (b > a) > (b > b) > b). 0.54/0.73 thf(decl_100, type, esk34_4: (a > a) > (b > a) > (b > a) > (b > b) > b). 0.54/0.73 thf(decl_101, type, esk35_4: (nat > b) > (nat > nat) > (nat > nat) > (nat > b) > nat). 0.54/0.73 thf(decl_102, type, esk36_4: (a > a) > (a > a) > (a > b) > (b > a) > a). 0.54/0.73 thf(decl_103, type, esk37_4: (b > b) > (b > a) > (b > b) > (a > b) > b). 0.54/0.73 thf(decl_104, type, esk38_4: (a > b) > (nat > nat) > (nat > b) > (nat > a) > nat). 0.54/0.73 thf(decl_105, type, esk39_4: (a > b) > (b > nat) > (b > a) > (nat > b) > b). 0.54/0.73 thf(decl_106, type, esk40_4: (nat > b) > (b > b) > (b > b) > (b > nat) > b). 0.54/0.73 thf(decl_107, type, esk41_4: (a > a) > (a > a) > (a > nat) > (nat > a) > a). 0.54/0.73 thf(decl_108, type, esk42_4: (b > b) > (b > b) > (b > b) > (b > b) > b). 0.54/0.73 thf(decl_109, type, esk43_4: (b > a) > (a > b) > (a > a) > (a > a) > a). 0.54/0.73 thf(decl_110, type, esk44_4: (a > nat) > (nat > nat) > (nat > nat) > (nat > a) > nat). 0.54/0.73 thf(decl_111, type, esk45_4: (a > b) > (b > a) > (b > b) > (b > b) > b). 0.54/0.73 thf(decl_112, type, esk46_2: nat > (nat > b) > nat). 0.54/0.73 thf(decl_113, type, esk47_2: nat > (nat > a) > nat). 0.54/0.73 thf(decl_114, type, esk48_2: nat > (nat > a) > nat). 0.54/0.73 thf(decl_115, type, esk49_2: nat > (nat > b) > nat). 0.54/0.73 thf(decl_116, type, esk50_0: nat). 0.54/0.73 thf(fact_4_comp__apply, axiom, ((comp_nat_a_nat)=(^[X7:nat > a, X14:nat > nat, X15:nat]:(X7 @ (X14 @ X15)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_4_comp__apply)). 0.54/0.73 thf(fact_155_i__drop__nth, axiom, ((listIn1417627087drop_a)=(^[X9:nat, X477:nat > a, X15:nat]:(X477 @ (plus_plus_nat @ X9 @ X15)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_155_i__drop__nth)). 0.54/0.73 thf(conj_0, conjecture, ((listIn1417627087drop_a @ n @ (comp_b_a_nat @ f @ g))=(comp_b_a_nat @ f @ (listIn1417627088drop_b @ n @ g))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.54/0.73 thf(fact_69_comp__eq__dest__lhs, axiom, ![X199:b > a, X200:nat > b, X201:nat > a, X66:nat]:((((comp_b_a_nat @ X199 @ X200)=(X201))=>((X199 @ (X200 @ X66))=(X201 @ X66)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_69_comp__eq__dest__lhs)). 0.54/0.73 thf(fact_156_i__drop__nth, axiom, ((listIn1417627088drop_b)=(^[X9:nat, X478:nat > b, X15:nat]:(X478 @ (plus_plus_nat @ X9 @ X15)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_156_i__drop__nth)). 0.54/0.73 thf(fact_187_add_Ocommute, axiom, ((plus_plus_nat)=(^[X513:nat, X514:nat]:(plus_plus_nat @ X514 @ X513))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_187_add_Ocommute)). 0.54/0.73 thf(fact_70_comp__eq__dest__lhs, axiom, ![X202:nat > a, X203:nat > nat, X204:nat > a, X66:nat]:((((comp_nat_a_nat @ X202 @ X203)=(X204))=>((X202 @ (X203 @ X66))=(X204 @ X66)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_70_comp__eq__dest__lhs)). 0.54/0.73 thf(c_0_7, plain, ((comp_nat_a_nat)=(^[Z0:nat > a, Z1:nat > nat, Z2:nat]:(Z0 @ (Z1 @ Z2)))), inference(fof_simplification,[status(thm)],[fact_4_comp__apply])). 0.54/0.73 thf(c_0_8, plain, ((listIn1417627087drop_a)=(^[Z0:nat, Z1:nat > a, Z2:nat]:(Z1 @ (plus_plus_nat @ Z0 @ Z2)))), inference(fof_simplification,[status(thm)],[fact_155_i__drop__nth])). 0.54/0.73 thf(c_0_9, plain, ((comp_nat_a_nat)=(^[Z0:nat > a, Z1:nat > nat, Z2:nat]:(Z0 @ (Z1 @ Z2)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.54/0.73 thf(c_0_10, plain, ((listIn1417627087drop_a)=(^[Z0:nat, Z1:nat > a, Z2:nat]:(Z1 @ (plus_plus_nat @ Z0 @ Z2)))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.54/0.73 thf(c_0_11, negated_conjecture, ((listIn1417627087drop_a @ n @ (comp_b_a_nat @ f @ g))!=(comp_b_a_nat @ f @ (listIn1417627088drop_b @ n @ g))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.54/0.73 thf(c_0_12, plain, ![X3:nat > a, X14:nat > nat]:(((^[Z0:nat]:(X3 @ (X14 @ Z0)))=(comp_nat_a_nat @ X3 @ X14))), inference(arg_cong,[status(thm)],[c_0_9])). 0.54/0.73 thf(c_0_13, plain, ![X1:nat, X3:nat > a]:(((^[Z0:nat]:(X3 @ (plus_plus_nat @ X1 @ Z0)))=(listIn1417627087drop_a @ X1 @ X3))), inference(arg_cong,[status(thm)],[c_0_10])). 0.54/0.73 thf(c_0_14, plain, ![X1687:b > a, X1688:nat > b, X1689:nat > a, X1690:nat]:((((comp_b_a_nat @ X1687 @ X1688)!=(X1689))|((X1687 @ (X1688 @ X1690))=(X1689 @ X1690)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_69_comp__eq__dest__lhs])])). 0.54/0.73 thf(c_0_15, plain, ((listIn1417627088drop_b)=(^[Z0:nat, Z1:nat > b, Z2:nat]:(Z1 @ (plus_plus_nat @ Z0 @ Z2)))), inference(fof_simplification,[status(thm)],[fact_156_i__drop__nth])). 0.54/0.73 thf(c_0_16, plain, ((plus_plus_nat)=(^[Z0:nat, Z1:nat]:(plus_plus_nat @ Z1 @ Z0))), inference(fof_simplification,[status(thm)],[fact_187_add_Ocommute])). 0.54/0.73 thf(c_0_17, plain, ![X2031:nat > a, X2032:nat > nat, X2033:nat > a, X2034:nat]:((((comp_nat_a_nat @ X2031 @ X2032)!=(X2033))|((X2031 @ (X2032 @ X2034))=(X2033 @ X2034)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_70_comp__eq__dest__lhs])])). 0.54/0.73 thf(c_0_18, negated_conjecture, ((listIn1417627087drop_a @ n @ (comp_b_a_nat @ f @ g))!=(comp_b_a_nat @ f @ (listIn1417627088drop_b @ n @ g))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.54/0.73 thf(c_0_19, plain, ![X3:nat > a, X1:nat]:(((listIn1417627087drop_a @ X1 @ X3)=(comp_nat_a_nat @ X3 @ (plus_plus_nat @ X1)))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.54/0.73 thf(c_0_20, plain, ![X18:b > a, X4:nat > b, X1:nat, X3:nat > a]:((((X18 @ (X4 @ X1))=(X3 @ X1))|((comp_b_a_nat @ X18 @ X4)!=(X3)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.54/0.73 thf(c_0_21, plain, ((listIn1417627088drop_b)=(^[Z0:nat, Z1:nat > b, Z2:nat]:(Z1 @ (plus_plus_nat @ Z0 @ Z2)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.54/0.73 thf(c_0_22, plain, ((plus_plus_nat)=(^[Z0:nat, Z1:nat]:(plus_plus_nat @ Z1 @ Z0))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.54/0.73 thf(c_0_23, plain, ![X3:nat > a, X1:nat, X14:nat > nat, X5:nat > a]:((((X3 @ (X14 @ X1))=(X5 @ X1))|((comp_nat_a_nat @ X3 @ X14)!=(X5)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.54/0.73 thf(c_0_24, negated_conjecture, ((comp_b_a_nat @ f @ (listIn1417627088drop_b @ n @ g))!=(comp_nat_a_nat @ (comp_b_a_nat @ f @ g) @ (plus_plus_nat @ n))), inference(rw,[status(thm)],[c_0_18, c_0_19])). 0.54/0.73 thf(c_0_25, plain, ![X18:b > a, X4:nat > b, X1:nat]:(((X18 @ (X4 @ X1))=(comp_b_a_nat @ X18 @ X4 @ X1))), inference(er,[status(thm)],[c_0_20])). 0.54/0.73 thf(c_0_26, plain, ![X1:nat, X4:nat > b, X2:nat]:(((X4 @ (plus_plus_nat @ X1 @ X2))=(listIn1417627088drop_b @ X1 @ X4 @ X2))), inference(arg_cong,[status(thm)],[c_0_21])). 0.54/0.73 thf(c_0_27, plain, ![X2:nat, X1:nat]:(((plus_plus_nat @ X1 @ X2)=(plus_plus_nat @ X2 @ X1))), inference(arg_cong,[status(thm)],[c_0_22])). 0.54/0.73 thf(c_0_28, plain, ![X3:nat > a, X14:nat > nat, X1:nat]:(((X3 @ (X14 @ X1))=(comp_nat_a_nat @ X3 @ X14 @ X1))), inference(er,[status(thm)],[c_0_23])). 0.54/0.73 thf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_24]), c_0_25]), c_0_26]), c_0_27]), c_0_28]), c_0_27]), c_0_25])]), ['proof']). 0.54/0.73 # SZS output end CNFRefutation 0.54/0.73 # Parsed axioms : 398 0.54/0.73 # Removed by relevancy pruning/SinE : 74 0.54/0.73 # Initial clauses : 459 0.54/0.73 # Removed in clause preprocessing : 9 0.54/0.73 # Initial clauses in saturation : 450 0.54/0.73 # Processed clauses : 1358 0.54/0.73 # ...of these trivial : 55 0.54/0.73 # ...subsumed : 870 0.54/0.73 # ...remaining for further processing : 432 0.54/0.73 # Other redundant clauses eliminated : 272 0.54/0.73 # Clauses deleted for lack of memory : 0 0.54/0.73 # Backward-subsumed : 12 0.54/0.73 # Backward-rewritten : 12 0.54/0.73 # Generated clauses : 11705 0.54/0.73 # ...of the previous two non-redundant : 10780 0.54/0.73 # ...aggressively subsumed : 0 0.54/0.73 # Contextual simplify-reflections : 6 0.54/0.73 # Paramodulations : 11176 0.54/0.73 # Factorizations : 21 0.54/0.73 # NegExts : 25 0.54/0.73 # Equation resolutions : 286 0.54/0.73 # Propositional unsat checks : 0 0.54/0.73 # Propositional check models : 0 0.54/0.73 # Propositional check unsatisfiable : 0 0.54/0.73 # Propositional clauses : 0 0.54/0.73 # Propositional clauses after purity: 0 0.54/0.73 # Propositional unsat core size : 0 0.54/0.73 # Propositional preprocessing time : 0.000 0.54/0.73 # Propositional encoding time : 0.000 0.54/0.73 # Propositional solver time : 0.000 0.54/0.73 # Success case prop preproc time : 0.000 0.54/0.73 # Success case prop encoding time : 0.000 0.54/0.73 # Success case prop solver time : 0.000 0.54/0.73 # Current number of processed clauses : 341 0.54/0.73 # Positive orientable unit clauses : 61 0.54/0.73 # Positive unorientable unit clauses: 43 0.54/0.73 # Negative unit clauses : 13 0.54/0.73 # Non-unit-clauses : 224 0.54/0.73 # Current number of unprocessed clauses: 9824 0.54/0.73 # ...number of literals in the above : 26643 0.54/0.73 # Current number of archived formulas : 0 0.54/0.73 # Current number of archived clauses : 24 0.54/0.73 # Clause-clause subsumption calls (NU) : 7939 0.54/0.73 # Rec. Clause-clause subsumption calls : 5777 0.54/0.73 # Non-unit clause-clause subsumptions : 701 0.54/0.73 # Unit Clause-clause subsumption calls : 1108 0.54/0.73 # Rewrite failures with RHS unbound : 5 0.54/0.73 # BW rewrite match attempts : 7284 0.54/0.73 # BW rewrite match successes : 477 0.54/0.73 # Condensation attempts : 1358 0.54/0.73 # Condensation successes : 40 0.54/0.73 # Termbank termtop insertions : 452627 0.54/0.73 0.54/0.73 # ------------------------------------------------- 0.54/0.73 # User time : 0.242 s 0.54/0.73 # System time : 0.016 s 0.54/0.73 # Total time : 0.258 s 0.54/0.73 # Maximum resident set size: 4380 pages 0.54/0.73 0.54/0.73 # ------------------------------------------------- 0.54/0.73 # User time : 0.255 s 0.54/0.73 # System time : 0.019 s 0.54/0.73 # Total time : 0.274 s 0.54/0.73 # Maximum resident set size: 2424 pages 0.54/0.73 EOF